On Optimization 14 : 732 - - 742 , 2004 Minimization of Error Functionals over Variable - Basis Functions
نویسندگان
چکیده
There is investigated generalized Tychonov well-posedness of the problem of minimization of error functionals over admissible sets formed by variable-basis functions, which include neural networks. For admissible sets formed by variable-basis functions of increasing complexity, rates of decrease of infima of error functionals are estimated. There are derived upper bounds on such rates that do not exibit the curse of dimensionality with respect to the number of variables of admissible functions.
منابع مشابه
Minimization of Error Functionals over Variable-Basis Functions
Generalized Tikhonov well-posedness is investigated for the problem of minimization of error functionals over admissible sets formed by variable-basis functions, i.e., linear combinations of a fixed number of elements chosen from a given basis without a prespecified ordering. For variablebasis functions of increasing complexity, rates of decrease of infima of error functionals are estimated. Up...
متن کاملRates of Minimization of Error Functionals over Boolean Variable-Basis Functions
Approximate solution of optimization tasks that can be formalized as minimization of error functionals over admissible sets computable by variable-basis functions (i.e., linear combinations of n-tuples of functions from a given basis) is investigated. Estimates of rates of decrease of infima of such functionals over sets formed by linear combinations of increasing number n of elements of the ba...
متن کاملISOGEOMETRIC TOPOLOGY OPTIMIZATION OF STRUCTURES CONSIDERING WEIGHT MINIMIZATION AND LOCAL STRESS CONSTRAINTS
The Isogeometric Analysis (IA) is utilized for structural topology optimization considering minimization of weight and local stress constraints. For this purpose, material density of the structure is assumed as a continuous function throughout the design domain and approximated using the Non-Uniform Rational B-Spline (NURBS) basis functions. Control points of the density surface are...
متن کاملMinimization of Error Functionals over Perceptron Networks
Supervised learning of perceptron networks is investigated as an optimization problem. It is shown that both the theoretical and the empirical error functionals achieve minima over sets of functions computable by networks with a given number n of perceptrons. Upper bounds on rates of convergence of these minima with n increasing are derived. The bounds depend on a certain regularity of training...
متن کاملIpiano: Inertial Proximal Algorithm for Non-convex Optimization
This paper studies the minimization of non-convex and non-smooth composite functions. In particular, we discuss the algorithm proposed by Ochs et al. in [14], called iPiano. Following [14], we present a global convergence result for functions satisfying the Kurdyka-Lojasiewicz property [12, 11] which is based on the work by Attouch et al. [4]. Furthermore, we discuss the implementation of iPian...
متن کامل